#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>

using namespace std;

typedef long long ll;
int main() {
    ll n; cin >> n;
    ll m = 0;

    vector<int> a(10, 0);
    while (n)
    {
        int x = n % 10;
        if (a[x] == 0)
        {
            a[x]++;
            m = m * 10 + x;
        }
        n /= 10;
    }
    cout << m << endl;
    return 0;
}

// typedef long long ll;
int  n;
int main2() {
    cin >> n; priority_queue<ll, vector<ll>, greater<ll>> heap;
    while (n--)
    {
        ll x;
        cin >> x;
        heap.push(x);
    }

    ll _long = 0;

    while (heap.size() > 1)
    {
        ll l1 = heap.top(); heap.pop();
        ll l2 = heap.top(); heap.pop();
        heap.push(l1 + l2);
        _long += l1 + l2;
    }

    cout << _long << endl;

    return 0;
}
